Fast Multiplication in Finite Fields GF(2)
نویسنده
چکیده
A method is described for performing computations in a finite field GF(2 ) by embedding it in a larger ring Rp where the multiplication operation is a convolution product and the squaring operation is a rearrangement of bits. Multiplication in Rp has complexity N +1, which is approximately twice as efficient as optimal normal basis multiplication (ONB) or Montgomery multiplication in GF(2 ), while squaring has approximately the same efficiency as ONB. Inversion and solution of quadratic equations can also be performed at least as fast as previous methods.
منابع مشابه
Dual-Field Multiplier Architecture for Cryptographic Applications
The multiplication operation in finite fields GF (p) and GF (2) is the most often used and timeconsuming operation in the harware and software realizations of public-key cryptographic systems, particularly elliptic curve cryptography. We propose a new hardware architecture for fast and efficient execution of the multiplication operation in this paper. The proposed architecture is scalable, i.e....
متن کاملOn Fast Multiplication in Binary Finite Fields and Optimal Primitive Polynomials over GF(2)
In this paper we present a number of algorithms and optimizationtechniques to speedup computations in binary extension fields overGF(2). Particularly, we consider multiplication and modular reduc-tion solutions. Additionally, we provide the table of optimal binaryprimitive polynomials over GF(2) of degree 2 ≤ d < 2048, and theclass of functions for optimal modular reduction ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملEfficient Software Implementations of Large Finite Fields GF (2) for Secure Storage Applications
Finite fields are widely used in constructing error-correcting codes and cryptographic algorithms. In practice, error-correcting codes use small finite fields to achieve high-throughput encoding and decoding. Conversely, cryptographic systems employ considerably larger finite fields to achieve high levels of security. We focus on developing efficient software implementations of arithmetic opera...
متن کاملInstruction Set Extensions for Fast Arithmetic in Finite Fields GF(p) and GF(2)
Instruction set extensions are a small number of custom instructions specifically designed to accelerate the processing of a given kind of workload such as multimedia or cryptography. Enhancing a general-purpose RISC processor with a few application-specific instructions to facilitate the inner loop operations of public-key cryptosystems can result in a significant performance gain. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000